منابع مشابه
Validating Database Constraints and Updates Using Automated Reasoning Techniques
In this paper, we propose a new approach to the validation of formal speciications of integrity constraints. The validation problem of formal speciications consists of assuring whether the formal speciication corresponds with what the domain specialist intends. This is distinct from the veriication problem, which is the problem whether an implementation (which is a formal object) corresponds wi...
متن کاملOn Specifying Database Updates
D We address the problem of formalizing the evolution of a database under the effect of an arbi trary sequence of update transactions. We do so by appealing to a first-order representation language called the situation calculus, which is a s tandard approach in artificial intelligence to the formalization of planning problems. We formalize database transactions in exactly the same way as action...
متن کاملNatural Language Database Updates
Although a great deal of research effort has been expended in support of natural language (NL) database querying, little effort has gone to NL database update. One reason for this state of affairs is that in NL querying, one can tie nouns and stative verbs in the query to database objects (relation names, attributes and domain values). In many cases this correspondence seems sufficient to inter...
متن کاملMaximal Expansions of Database Updates
Databases with integrity constraints IC are considered For each DB update i e a set of facts to add and of facts to delete the IC implies its correct expansion new facts to add and new facts to delete Simultaneously each expanded update induces a correct simpli cation of the IC In the limit this sequence of expansions and simpli ca tions converges to the maximal correct update expansion indepen...
متن کاملLoop Elimination for Database Updates
The additional expressive power of procedural extensions of query and update languages come at the expense of trading the efficient set-at-a-time processing of database engines for the much less efficient tuple-at-a-time processing of a procedural language. In this work, we consider the problem of rewriting for-loops with update statements into sequences of updates which do not use loops or cur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 1984
ISSN: 0306-4379
DOI: 10.1016/0306-4379(84)90012-7